elitist continuous ant colony optimization algorithm: application to reservoir operation problems

نویسندگان

m.h. afshar

h. ketabchi

e. rasa

چکیده

in this paper, a new continuous ant colony optimization (caco) algorithm is proposed for optimal reservoir operation. the paper presents a new method of determining and setting a complete set of control parameters for any given problem, saving the user from a tedious trial and error based approach to determine them. the paper also proposes an elitist strategy for caco algorithm where best solution of each iteration is directly copied to the next iteration to improve performance of the method. the performance of the caco algorithm is demonstrated against some benchmark test functions and compared with some other popular heuristic algorithms. the results indicated good performance of the proposed method for global minimization of continuous test functions. the method was also used to find the optimal operation of the dez reservoir in southern iran, a problem in the reservoir operation discipline. a normalized squared deviation of the releases from the required demands is considered as the fitness function and the results are presented and compared with the solution obtained by non linear programming (nlp) and discrete ant colony optimization (daco) models. it is observed that the results obtained from caco algorithm are superior to those obtained from nlp and daco models.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Elitist Continuous Ant Colony Optimization Algorithm: Application to Reservoir Operation problems

In this paper, a new Continuous Ant Colony Optimization (CACO) algorithm is proposed for optimal reservoir operation. The paper presents a new method of determining and setting a complete set of control parameters for any given problem, saving the user from a tedious trial and error based approach to determine them. The paper also proposes an elitist strategy for CACO algorithm where best solut...

متن کامل

Improved Ant Colony Optimization Algorithm for Reservoir Operation

In this paper, an improved Ant Colony Optimization (ACO) algorithm is proposed for reservoir operation. Through a collection of cooperative agents called ants, the near-optimum solution to the reservoir operation can be e ectively achieved. To apply the proposed ACO algorithm, the problem is approached by considering a nite horizon with a time series of in ow, classifying the reservoir volume t...

متن کامل

Reservoir Operation by Ant Colony Optimization Algorithms

In this paper, ant colony optimization (ACO) algorithms are proposed for reservoir operation. Through a collection of cooperative agents called ants, the near-optimum solution to the reservoir operation can be effectively achieved. To apply ACO algorithms, the problem is approached by considering a finite horizon with a time series of inflow, classifying the reservoir volume to several interval...

متن کامل

Multi-Colony Ant Algorithm for Continuous Multi-Reservoir Operation Optimization Problem

Ant Colony Optimization (ACO) algorithms are basically developed for discrete optimization and hence their application to continuous optimization problems require the transformation of a continuous search space to a discrete one by discretization of the continuous decision variables. Thus, the allowable continuous range of decision variables is usually discretized into a discrete set of allowab...

متن کامل

Ant Colony Optimization for Multi-Purpose Reservoir Operation

In this paper a metaheuristic technique called Ant Colony Optimization (ACO) is proposed to derive operating policies for a multi-purpose reservoir system. Most of the real world problems often involve non-linear optimization in their solution with high dimensionality and large number of equality and inequality constraints. Often the conventional techniques fail to yield global optimal solution...

متن کامل

multi-reservoir operation by adaptive pheromone re-initiated ant colony optimization algorithm

through a collection of cooperative agents called ants, the near optimal solution to the multi-reservoir operation problem may be effectively achieved employing ant colony optimization algorithms (acoas). the problem is approached by considering a finite operating horizon, classifying the possible releases from the reservoir(s) into pre-determined intervals, and projecting the problem on a grap...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of civil engineering

جلد ۴، شماره ۴، صفحات ۲۷۴-۲۸۵

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023